R/parallel – speeding up bioinformatics analysis with R

Speeding Up Enumeration Algorithms with Amortized Analysis

In this paper, we characterize a class of fast enumeration algorithms and propose a method for constructing algorithms belonging to the class. The characterization is obtained from a new method of amortized analysis. We propose fast algorithms for enumerating matroid bases, directed spanning trees, and bipartite perfect matchings. These are our results in recent four years. Studies on speeding ...

Speeding up R-LWE Post-quantum Key Exchange

Post-quantum cryptography has attracted increased attention in the last couple of years, due to the threat of quantum computers breaking current cryptosystems. In particular, the key size and performance of post-quantum algorithms became a significant target for optimization. In this spirit, Alkim et al. have recently proposed a significant optimization for a key exchange scheme that is based o...

Speeding-up Reinforcement Learning with

Speeding up Static Probabilistic Timing Analysis

Probabilistic Timing Analysis (PTA) has emerged recently to derive trustworthy and tight WCET estimates. Computational costs due to the use of the mathematical operator called convolution used by SPTA – the static variant of PTA – and also deployed in many domains including signal and image processing, jeopardize the scalability of SPTA to real-size programs. We evaluate, qualitatively and quan...

Speeding Up SMT-Based Quantitative Program Analysis

Quantitative program analysis involves computing numerical quantities about individual or collections of program executions. An example of such a computation is quantitative information flow analysis, where one estimates the amount of information leaked about secret data through a program’s output channels. Such information can be quantified in several ways, including channel capacity and (Shan...